lower bound neighbor search metric expans rank mechan twitter dlike forum studi problem design mechan rank item forum make user review thumb star rate compar mechan forum user rate individu post mechan user ask perform pairwis comparison state main metric evalu mechan rank accuraci cost review cost measur averag number review post show reason probabl model thumb star base rank mechan produc approxim accur rank bound number review item hand provid review mechan base pairwis comparison achiev approxim rank bound cost implement system shoutveloc twitter forum item tweet twitter rate comparison item user post item requir compar previou entri ensur sequenc post comparison requir review item averag mechan sequenc comparison obtain rank estim ensur item review win entri review obtain estim top item sketch dbase distanc oracl web dscale graph studi fundament problem comput distanc node larg graph web graph social network object answer distanc queri pair node real time standard shortest path algorithm expens approach move time consum shortest path comput offlin queri time precomput valu perform simpl fast comput precomput valu specif offlin phase comput store small sketch node graph queri time sketch sourc destin node perform simpl comput sketch estim distanc categori subject descriptor graph theori graph algorithm path circuit problem revisit examin hypothesi queri specif posit bia lower bound neighbor search metric expans predict strategi loss understand fashion cycl social choic dexpert view ture machin proof verifi mental reason understand cycl knowledg rise preserv decai determinist approxim algorithm nearest codeword problem spars cut project graph stream abstract find spars cut import tool analyz larg graph aris practic web graph onlin social commun vlsi circuit deal graph billion node hard visual global partit studi spars cut tradition look cut respect node graph recent work analyz graph properti project small subset vertic interest context relev document queri search engin paper studi spars cut graph partit subset node call partit cut project studi problem find cut project stream model context input graph larg store main memori specif regular graph node cut conduct constant balanc show parti tion randomli chosen set node pass graph stream space choic result partit project cut conduct note lt pass space sublinear number node oil search problem abstract potenti oil locat oil depth seek good trade off number oil sourc found total amount drill perform cost explor locat proport depth drill algorithm clue depth oil sourc locat abstract oil search problem appli natur life context research decid research problem invest time natur dilemma invest time problem share time problem spent lot time problem success continu move problem studi problem competit analysi compar cost algorithm adversari depth oil sourc competit ratio algorithm problem measur perform strategi compar weaker adversari set depth oil sourc locat depth surprisingli find find oil sourc strategi cost close adversari limit knowledg set depth show adversari find oil sourc drill cost know set depth strategi find sourc drill cost prove strategi close strategi total absenc inform dwai cuckoo hash price dand da dbit abstract studi hash close relat analysi ball bin item hash memori locat ball thrown bin azar al consid put ball full random bin lower probabl bin exce load exponenti small doubli exponenti give maximum load log log high probabl cuckoo hash draw idea item hash bucket capac full insert procedur move previous insert item altern bucket make space item natur implement bucket repres partit fix arrai memori overlap block size item hash block store locat analyz simpl twist item hash arbitrari size memori block consecut block longer disjoint overlap locat twist increas space util gener method improv util lookup access item random locat result surpris opposit cuckoo set item move insert shift overlap overlap block make distribut uniform sampl neighborhood graph make salsa faster paper attempt improv effect effici queri depend link base rank algorithm hit max salsa rank algorithm view result queri node web graph expand result set includ neighbor node comput score induc neighborhood graph previou work shown salsa substanti effect queri independ link base rank algorithm pagerank work show whittl neighborhood graph consist sampl node edg make salsa cousin faster effici effect offer hypothesi reduc graph improv perform hardwar platform effici worm outbreak detect error dcorrect code ternari content address memori geometr approach lower bound approxim dneighbor search partial match work investig geometr approach prove cell probe lower bound data structur problem approxim nearest neighbor search problem boolean hypercub log show random data structur problem answer approxim nearest neighbor search queri probe space ct bound impli data structur space polylogarithm word size constant probabl constant approxim nearest neighbor search queri probe log log log time improv lower bound log log log log log probe shown chakrabarti regev polynomi space data structur log log lower bound tra cu thorup linear space data structur lower bound hold neighbor problem algorithm advanc good approxim distanc nearest neighbor addition averag case lower bound natur distribut problem approach bound approxim farthest neighbor problem case adapt algorithm improv bound slightli show log lower bound time complex data structur space logarithm word size show similar lower bound partial match problem random probe data structur solv partial match problem log space impli log log log lower bound time complex linear space data structur slightli improv log log log lower bound rang recent independ tra cu achiev similar bound result gener approxim partial match improv bound improv algorithm find nearest neighbor kd dtree abstract suggest simpl modif kd tree search algorithm nearest neighbor search result improv perform kd tree data structur work find nearest neighbor low dimens perform degrad number dimens increas exact nearest neighbor search problem suffer curs dimension focu approxim solut approxim nearest neighbor neighbor distanc time distanc nearest neighbor show randomli construct databas point queri point chosen close point data base tradit kd tree search algorithm low probabl find approxim nearest neighbor probabl success drop exponenti number dimens simpl chang search algorithm result higher chanc success search queri point kd tree search random set point neighborhood queri point turn search point find approxim nearest neighbor higher chanc success power min dhash similar search hierarch data object power min hash similar search hierarch estim pagerank graph stream studi focus comput larg graph web graph edg graph present stream object stream model small amount memori prefer linear number node pass stream model show perform graph comput includ estim probabl distribut random walk length mix time conduct estim mix time random walk mn space pass relat mix time conduct estim conduct graph appli algorithm comput probabl distribut web graph estim pagerank node addit error pass min spam botnet signatur characterist paper focu character spam botnet leverag spam payload spam server traffic properti goal develop spam signatur gener framework call autor detect botnet base spam email botnet membership autor requir pre classifi train data white list output high qualiti regular express signatur detect botnet spam low fals posit rate month sampl email hotmail autor successfulli identifi botnet base spam campaign uniqu botnet host ip address depth analysi identifi botnet reveal interest find degre email obfusc properti botnet ip address send pattern correl network scan traffic observ inform design botnet detect scheme trace reconstruct constant delet probabl relat result design tradeoff ssd perform solid state disk ssd potenti revolution storag system landscap publish work intern organ design choic ssd manufactur face pursuit optim perform paper present taxonomi design choic analyz perform configur trace driven simul workload trace extract real system find ssd perform lifetim highli workloadsensit complex system problem higher storag stack distribut system relev devic firmwar bound frequenc moment random dorder stream determinist approxim algorithm nearest codeword problem find frequent element data stream propos approxim integr approach solv problem find popular element find frequent element data stream come larg domain solut space effici report frequent top element tight guarante error gener data distribut top algorithm return element roughli highest frequenc limit space calcul frequent element realist zipfian data space requir propos algorithm solv exact frequent element problem decreas dramat paramet distribut top queri analysi ensur top element correct order report experi real synthet data set show space reduct loss accuraci prove effect propos approach analysi experi extend answer continu queri frequent top element problem increment report frequent top element applic knowledg solut propos find frequent element dbursti stream abstract present algorithm find frequent element stream arriv bursti depend amount bursti stream algorithm detect element frequenc space wheref frequenc moment stream space complex achiev stream complet bursti element arriv contigu group attain arriv order random space complex paramet captur bursti stream li major advantag algorithm rel frequenc element fix space complex decreas length stream stream bursti estim sum weight sampl bloom filter speed hit dlike rank algorithm abstract paper describ techniqu reduc querytim cost hit rank algorithm basic idea comput node web graph summari neighborhood queri independ oper line approxim neighborhood graph result set queri time combin summari result set node approxim queri specif neighborhood graph perform queri depend link base rank algorithm hit salsa evalu techniqu larg web graph substanti set queri partial judg result found effect retriev perform compar origin salsa algorithm effici queri time speed substanti higher queri price inform databas conjunct case tcam dbase parallel architectur high dspeed packet forward comput shortest path uncertainti problem estim length shortest path dag edg length approxim determin cost obtain posit neg result exact problem approxim lower bound local sensit hash fraction match ball dand dbin exploit asymmetri hierarch topic extract estim corpu size queri dictionari approxim string search longest prefix search improv construct count bloom filter abstract count bloom filter cbf gener bloom filter data structur membership queri set chang dynam insert delet bloom filter cbf obtain space save allow fals posit provid simpl hash base altern base left hash call left cbf dlcbf dlcbf offer function cbf space gener save factor describ construct dlcbf provid analysi demonstr effect experiment achiev anonym cluster publish data analysi tabl person record maintain individu privaci problem increas import todai tradit approach de identifi record remov identifi field social secur number recent research shown larg fraction popul identifi kei attribut call quasi identifi date birth gender zip code sweenei propos anonym model privaci kei attribut leak inform suppress gener record modifi tabl record valu quasi identifi propos method anonym data record quasi identifi data record cluster cluster center publish ensur privaci data record impos constraint bloom filter approxim membership check approxim state machin network applic requir fast state lookup concurr state machin track state larg number flow simultan question compactli repres concurr state machin achiev compact data structur approxim concurr state machin acsm return fals posit fals neg don respons describ techniqu base bloom filter hash evalu theoret analysi simul analysi lead extrem effici hash base scheme paramet chosen trade space comput impact error hash approach yield simpl altern structur function count bloom filter space show acsm video congest control acsm router implement sophist activ queue manag aqm techniqu video traffic standard mark packet chang video format factor reduct memori compar full state scheme error show acsm show promis real time detect traffic entropi base nearest neighbor search high dimens balanc alloc graph analyz bittorr relat peer dto dpeer network high dspeed low dpower network search engin adapt block dselect scheme algorithm databas layout problem abstract present formal analysi databas layout problem problem determin databas object tabl index assign disk drive optim layout direct impact perform entir system tradit approach stripe object disk drive aim optim parallel suboptim queri access databas object merg join tabl due increas random disk seek adopt exist model take account benefit parallel overhead due random disk access context queri workload includ access databas object result optim problem intract gener emploi techniqu approxim algorithm present provabl perform guarante show optim exploit parallel suggest uniformli stripe data object heterogen file disk optim random disk access assign data object singl disk drive confirm intuit effect tension provid approxim algorithm attempt optim trade effect show algorithm achiev approxim ratio anonym tabl privaci concern microdata releas ad hoc analys privaci goal exist privaci protect approach anonym divers suitabl categor sensit attribut appli directli numer sensit attribut salari result undesir inform leakag propos privaci goal captur privaci protect numer sensit attribut complement desir privaci support ad hoc aggreg analys microdata exist gener base anonym approach answer aggreg queri reason accuraci present gener framework permutationbas anonym support accur answer aggreg queri show group permut base techniqu answer aggreg queri accur gener base approach propos criteria optim permut accur answer aggreg queri develop effici algorithm criterion effici hash lookup memori access entropi base nearest neighbor search high dimens balanc alloc graph lower bound local sensit hash smallest grammar problem thesi consid smallest grammar problem find smallest context free grammar gener string show problem intract object find approxim algorithm simpl question connect area research importantli link data compress store long string store small grammar gener small grammar string natur bring underli pattern fact dna analysi size smallest context free grammar gener string regard comput relax kolmogorov complex final work smallest grammar problem qualit extend studi approxim algorithm hierarch structur object thesi establish hard result evalu previous propos algorithm present procedur stronger approxim guarante minimum enclos polytop high dimens effici hash lookup memori access cluster minim sum cluster diamet studi problem cluster point metric space minim sumof cluster diamet sum cluster radii significantli improv previou result present combin request schedul web cach cwi found member ercim european research consortium informat mathemat cwi research theme orient structur group cluster list name cluster parenthes acronym repres graph metric fewest edg abstract problem obtain compress represent graph metric ad extra amp quot steiner amp quot vertic remov edg preserv distanc compress factor achiev ratio number edg origin graph number compress graph metric addit steiner vertic repres graph uniform edg weight show metric type benefici compress addit steiner vertic consist replac cliqu star center vertex steiner vertex give approxim algorithm problem compress singl cliqu show problem hard approxim vertex cover give log approxim algorithm respect optimum select disjoint cliqu log approxim algorithm respect optimum cliqu compress intersect constant number cliqu compress algorithm extend bipartit case complet bipartit subgraph compress final show compress cliqu hard approxim gamma ffl instanc optimum compress comput shortest path uncertainti problem estim length shortest path dag edg length approxim determin cost obtain posit neg result exact problem approxim stream algorithm cluster problem studi cluster ng pr blem str am model wher goal cluster set point make pass pass data small amount storsd space mainr esult ndomiz algor ithm median pre lem duce constant factor appr oxim pass storr space kpolylog signific imp vement pr iou algor hm yield appr ximat space sort search ternari cam combinatori algorithm max csp comput median uncertainti sort search ternari cam reduc tcam power consumpt increas throughput algorithm subset queri log mpc log space time nmc space mn queri time lt extend result gener problem orthogon rang search exact approxim version approxim orthogon rang intersect exact approxim version nearest neighbor problem introduct subset queri problem defin set subset ofa univers build data structur queri set ae udetect web cach request reorder current web cach algorithm process request order arriv restrict inevit system page due sequenti natur program http request essenti independ high volum proxi server proxi server exibl reorder request provid request inordin delai expect reorder request lead perform formul onlin reorder problem captur phenomenon unit cach give dynam program algorithm solv oin case give upper lower bound competit ratio onlin algorithm gener problem metric space approxim smallest grammar kolmogorov complex natur model problem find smallest context free grammar gener string length size grammar theoret interest effici comput variant kolmogorov complex problem practic import area data compress pattern extract smallest grammar cluster minim sum cluster diamet studi problem cluster point metric space minim sumof cluster diamet sum cluster radii significantli improv previou result present decid access problem extend abstract protect system provid formal basi studi secur access mechan comput system year recent context trust manag main object design analysi system express polici prescrib object interact share inform verifi undesir action place problem refer safeti access problem phrase form object gain illeg access object seri legal move prescrib polici work design protect system signi express power ectiv procedur verifi access paper studi gener protect system provid algorithm decid access system method involv relat problem membership problem class grammar reveal interest connect protect system grammar describ independ interest discoveri elegantli characteris famili grammar knowledg comput median uncertainti log approxim algorithm asymmetr dcenter problem consist hash random tree distribut cach protocol reliev hot spot world wide web describ famili cach protocol distrib ut network decreas elimin occurr hot spot network protocol design larg network internet delai caus hot spot sever feasibl server complet inform current state entir network protocol easi implement exist network protocol tcp ip requir overhead protocol work local control make effici exist resourc scale gracefulli network grow cach protocol base special kind hash call consist hash roughli speak consist hash function minim rang function develop good consist hash function develop cach protocol requir user current consist view network consist hash function eventu prove applic distribut server quorum system note optic rout tree bandwidth valuabl resourc wavelength divis multiplex optic network problem find optim assign wavelength request fundament import bandwidth util present polynomialtim algorithm problem fix constant size topolog combin algorithm idea raghavan upfal obtain optim assign wavelength constant degre undirect tree mihail kaklamani rao pose open question complex problem direct tree show np complet binari constant depth direct tree keyword algorithm combinatori problem comput complex interconnect network introduct motiv develop fiber optic network technolog wavelength divis multiplex wdm final reach point support onr young investig award work 